On the number of representations of certain integers as sums of eleven or thirteen squares
نویسنده
چکیده
Let rk(n) denote the number of representations of an integer n as a sum of k squares. We prove that for odd primes p, r11(p) = 330 31 (p + 1) − 22(−1)(p−1)/2p4 + 352 31 H(p), where H(p) is the coefficient of q in the expansion of
منابع مشابه
Geometryof Numbers Proof of Goo tzky’s Four-Squares Theorem
The totally positive algebraic integers of certain number fields have been shown to be the sums of four squares of integers from their respective fields. The case ofQð ffiffiffi 5 p Þ was demonstrated by Götzky and the cases of Qð ffiffiffi 2 p Þ and Qð ffiffiffi 3 p Þ were demonstrated by Cohn. In the latter situation, only those integers with even coefficient on the radical term could possibl...
متن کاملSome Ideas for Final Projects
1.8. Investigate algorithms for expressing an integer as a sum of squares. We have determined exactly which integers are sums of two squares. Later on in the course we will prove which integers are sums of four squares (Lagrange’s theorem) and state without proof which integers are sums of three squares (Legendre-Gauss theorem). But these methods do not give efficient algorithms for actually fi...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملRepresenting Integers as Sums of Squares
We study in detail the special case of Waring’s problem when the power k = 2. Ultimately, we prove that four is the least number of squares needed to represent any integer. To this end, we prove that some numbers cannot be represented as sums of two squares, some cannot be represented as sums of three, and all can be represented as sums of four. We also show that numbers of a certain form can b...
متن کامل1 F eb 2 00 5 ON SUMS OF THREE SQUARES
Let r 3 (n) be the number of representations of a positive integer n as a sum of three squares of integers. We give two distinct proofs of a conjecture of Wagon concerning the asymptotic value of the mean square of r 3 (n).
متن کامل